A Parallel Compact Gannet Optimization Algorithm for Solving Engineering Optimization Problems

The Gannet Optimization Algorithm (GOA) has good performance, but there is still room for improvement in memory consumption and convergence. In this paper, an improved proposed to solve five engineering optimization problems. compact strategy enables the GOA save a large amount of memory, parallel communication allows algorithm avoid falling into local optimal solutions. We improve through combination strategy, we name Parallel Compact (PCGOA). performance study PCGOA on CEC2013 benchmark demonstrates advantages our new method various aspects. Finally, results solving problems show that can find global solution more accurately.